A Fast Algorithm for Spherical Basis Approximation
نویسنده
چکیده
Radial basis functions appear in a wide field of applications in numerical mathematics and computer science. We present a fast algorithm for scattered data interpolation and approximation on the sphere with spherical radial basis functions of different spatial density. We discuss three settings, each leading to a special structure of the interpolation matrix allowing for an efficient implementation using discrete Fourier transforms. A numerical example is given to show the advantages of spherical radial basis functions with different spatial densities. 2000 AMS Subject Classification: 65T50, 65F30, 33C55, 15A23, 41A30.
منابع مشابه
Designinga Neuro-Sliding Mode Controller for Networked Control Systems with Packet Dropout
This paper addresses control design in networked control system by considering stochastic packet dropouts in the forward path of the control loop. The packet dropouts are modelled by mutually independent stochastic variables satisfying Bernoulli binary distribution. A sliding mode controller is utilized to overcome the adverse influences of stochastic packet dropouts in networked control system...
متن کاملAn efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation
Ramasubramanian, V. and K.K. Paliwal, An efficient approximation-elimination algorithm for fast nearest-neighbour search based on a spherical distance coordinate formulation, Pattern Recognition Letters 13 (1992) 471-480. An efficient approximation-elimination search algorithm for fast nearest-neighbour search is proposed based on a spherical distance coordinate formuTation, where a vector in K...
متن کاملgpALIGNER: A Fast Algorithm for Global Pairwise Alignment of DNA Sequences
Bioinformatics, through the sequencing of the full genomes for many species, is increasingly relying on efficient global alignment tools exhibiting both high sensitivity and specificity. Many computational algorithms have been applied for solving the sequence alignment problem. Dynamic programming, statistical methods, approximation and heuristic algorithms are the most common methods appli...
متن کاملL Bernstein Estimates and Approximation by Spherical Basis Functions
The purpose of this paper is to establish Lp error estimates, a Bernstein inequality, and inverse theorems for approximation by a space comprising spherical basis functions located at scattered sites on the unit n-sphere. In particular, the Bernstein inequality estimates Lp Bessel-potential Sobolev norms of functions in this space in terms of the minimal separation and the Lp norm of the functi...
متن کاملFast Voltage and Power Flow Contingency Ranking Using Enhanced Radial Basis Function Neural Network
Deregulation of power system in recent years has changed static security assessment to the major concerns for which fast and accurate evaluation methodology is needed. Contingencies related to voltage violations and power line overloading have been responsible for power system collapse. This paper presents an enhanced radial basis function neural network (RBFNN) approach for on-line ranking of ...
متن کامل